Daftardar-Jafari method for solving nonlinear thin film flow problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملA Comparison of Variational Iteration and Adomian Decomposition Methods in Solving Nonlinear Thin Film Flow Problems
This paper provides a comparative study of the Variational Iteration Method (VIM) and the Adomian Decomposition Method (ADM) to obtain analytic approximations of a nonlinear problem that arises in the thin film flow of a third grade fluid on a moving belt. An excellent agreement is observed between the series solutions for the velocity field obtained by these two methods. This comparison is ben...
متن کاملAn assessment of a semi analytical AG method for solving two-dimension nonlinear viscous flow
In this investigation, attempts have been made to solve two-dimension nonlinear viscous flow between slowly expanding or contracting walls with weak permeability by utilizing a semi analytical Akbari Ganji's Method (AGM). As regard to previous papers, solving of nonlinear equations is difficult and the results are not accurate. This new approach is emerged after comparing the achieved solutions...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arab Journal of Basic and Applied Sciences
سال: 2018
ISSN: 2576-5299
DOI: 10.1080/25765299.2018.1449345